Mapping Parallel Interactive Algorithms onto Workstation Networks
نویسندگان
چکیده
For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved signi cantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of xed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features su cient for the e cient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the e cacy of our scheme to support large-scale parallel computations. This research was supported in part by NSF under grants IRI-8910195, IRI-9041581 and CDA-8920936.
منابع مشابه
Practical Aspects Using a Distributed Queuing System
As more and more workstations interconnected by fast local area networks become available, the popularity of heterogeneous processing increases. On the other hand, it is not easy to spread tasks on machines diiering in software availability, hardware resources, and work-loads. It is hard to keep track of all tasks and even harder to collect their results. In our contribution we present experien...
متن کاملApplication Mapping onto Network-on-Chip using Bypass Channel
Increasing the number of cores integrated on a chip and the problems of system on chips caused to emerge networks on chips. NoCs have features such as scalability and high performance. NoCs architecture provides communication infrastructure and in this way, the blocks were produced that their communication with each other made NoC. Due to increasing number of cores, the placement of the cores i...
متن کاملS a I S T Bo S T O N Mapping Parallel Iterative Algorithms onto Workstation Networks
For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved signi cantly if a congestion control protocol is used to enhance network ...
متن کاملMapping parallel iterative algorithms onto workstation networks*
For communication-intensive parallel applications, the max imum degree of concurrency achievable i s limited by the communication throughput made available by the network. In previous work [lo], we showed experimentally that the performance of certain parallel applications running o n a workstation network can be improved significantly if a congestion control protocol i s used t o enhance netwo...
متن کاملParallel Simulation Algorithms for Grid - Based Analog Signal
In this paper, specialized algorithms for circuit-level simulation of grid-based analog signal processing arrays on a massively parallel processor are described and implementation results presented. In our approach, the trapezoidal rule is used to discretize the diierential equations that describe the analog array behavior, Newton's method is used to solve the nonlinear equations generated at e...
متن کامل